Description: 一个动态数组设置程序，可以增加，删除数组头，尾，和一般数组效率比较等-a dynamic array setup program can add, delete arrays head, tail, and the general comparison of the efficiency of the array Platform: |
Size: 29020 |
Author:liuyidao |
Hits:
Description: 程序的主要思想是先对数组进行处理，使其有序，处理后的结果存放在t1.txt文件中。。然后在此基础上建立索引，使在查字典时可以减少比较的次数，节省程序的时间。再利用最大匹配算法对程序进行分词，分词的结果保存在t2.txt文件中。然后再拿分好词的文件与libing_test文件进行比较匹配率，匹配结果存放在result.txt文件中。-procedures main idea is first to array processing, it orderly, After processing the results stored in t1.txt document. . Here then, based on the index so that the pressure can be reduced when compared to the number of procedures to save time. Reuse maximum matching algorithm to process segmentation, segmentation results in the preservation t2.txt document. Then use the sub-good word documents and document comparison libing_test matching rate Matching results stored in result.txt document. Platform: |
Size: 185594 |
Author:王磊 |
Hits:
Description: 用C51实现的拼音输入法,这是改写的网友 embuffalo、独步上载在www.21ic.com自由发布区的由张凯原作的51上的拼音输入法程序。
原作使用了一个二维数组用以查表，我认为这样比较的浪费空间，而且每个字表的索引地址要手工输入，效率不高。所以我用结构体将其改写了一下。就是大家现在看到的这个。
因为代码比较的大，共有6,000多汉字，这样就得要12,000 byte来存放GB内码，所以也是没办法的 :-(
编译结果约为3000h,因为大部分是索引表，代码优化几乎无效。
在Keil C里仿真芯片选用的是华邦的W77E58，它有32k ROM, 256B on-chip RAM, 1K on-chip SRAM (用DPTR1指针寻址,相当于有1K的片上xdata)。条件有限，没有上片试验，仿真而已。
打算将其移植到AVR上，但CodeAVRC与IAR EC++在结构体、指针的定义使用上似乎与C51不太一样，现在还未搞定。还希望在这方面有经验的网友能给予指导。-C51 with the Pinyin input method, which is rewritten netizens embuffalo. Unrivaled www.21ic.com available in the free publication of the original work by Kai-51 on the Pinyin input method procedures . Appreciate the use of a two-dimensional array for the look-up table, I think this is a waste of space. Each of the characters but the index table to manually input address, efficiency is not high. I use the structure to rewrite a bit. We see now is this. Because the code comparison, a total of 6, more than 000 Chinese characters, this must be 12, byte to store 000 GB code, is not the way to compile results :-( about 3000h. because most of the index table. Code Optimization almost ineffective. Keil in the C simulation uses the chip in W77E58 Winbond, It has 32 k ROM 256B on-chip RAM, 1K on-chi Platform: |
Size: 14619 |
Author:Jawen |
Hits:
Description: 1）实现以下常用的内部排序算法并对它们的时间效率进行比较：
必做（6种）：起泡排序、直接插入排序、简单选择排序、快速排序、希尔排序、堆排序；
选做：折半插入、二路归并、基数排序等等；
2）函数首部要求：void XXXXSort(char **list, int len, int n, int *c, int *s)
其中：
a) XXXXSort为排序函数名，具体如下：
起泡排序BubbleSort
直接插入排序InsertSort
简单选择排序SelectSort
快速排序QuickSort
希尔排序ShellSort
堆排序HeapSort
折半插入BInsertSort
二路归并Merge2Sort
基数排序RadixSort
b) list为二维字符数组的头指针，该二维数组的规格为：char list[n][len] 每行用于存放一个字符串（最大长度为len-1），共n行；
c) c用于返回关键字比较次数；
d) s用于返回移动次数；
3）要求把各种排序函数做成函数库（文件名统一为：sort.c），用统一提供的主程序进行调用和测评。
-a) achieve the following commonly used internal sorting algorithm as well as their time efficiency comparison : regimen (6) : bubble sort, direct insertion sequence and simple choice sorting, quick sort, Hill, ranked Heap Sort; elected to do : half of insertion, two-way merge. Sort base, and so on; 2) function first requirement : void XXXXSort (char ** list, int len, int n, int * c, int * s) which : a) XXXXSort sort of a function name, as follows : bubble sort BubbleSort direct insertion sort InsertSort simple choice ranking Sele ctSort Quick Sort QuickSort Hill Sorting ShellSort Heap Sort HeapS ort half insert BInsertSort two-way merge Merge2Sort radix sort Radi xSort b) list for the two-dimensional array of characters in the first indicator, the two-dimensional array specifications : cha Platform: |
Size: 10289 |
Author:战天 |
Hits:
Description: 一个动态数组设置程序，可以增加，删除数组头，尾，和一般数组效率比较等-a dynamic array setup program can add, delete arrays head, tail, and the general comparison of the efficiency of the array Platform: |
Size: 28672 |
Author:liuyidao |
Hits:
Description: 程序的主要思想是先对数组进行处理，使其有序，处理后的结果存放在t1.txt文件中。。然后在此基础上建立索引，使在查字典时可以减少比较的次数，节省程序的时间。再利用最大匹配算法对程序进行分词，分词的结果保存在t2.txt文件中。然后再拿分好词的文件与libing_test文件进行比较匹配率，匹配结果存放在result.txt文件中。-procedures main idea is first to array processing, it orderly, After processing the results stored in t1.txt document. . Here then, based on the index so that the pressure can be reduced when compared to the number of procedures to save time. Reuse maximum matching algorithm to process segmentation, segmentation results in the preservation t2.txt document. Then use the sub-good word documents and document comparison libing_test matching rate Matching results stored in result.txt document. Platform: |
Size: 185344 |
Author:王磊 |
Hits:
Description: 用C51实现的拼音输入法,这是改写的网友 embuffalo、独步上载在www.21ic.com自由发布区的由张凯原作的51上的拼音输入法程序。
原作使用了一个二维数组用以查表，我认为这样比较的浪费空间，而且每个字表的索引地址要手工输入，效率不高。所以我用结构体将其改写了一下。就是大家现在看到的这个。
因为代码比较的大，共有6,000多汉字，这样就得要12,000 byte来存放GB内码，所以也是没办法的 :-(
编译结果约为3000h,因为大部分是索引表，代码优化几乎无效。
在Keil C里仿真芯片选用的是华邦的W77E58，它有32k ROM, 256B on-chip RAM, 1K on-chip SRAM (用DPTR1指针寻址,相当于有1K的片上xdata)。条件有限，没有上片试验，仿真而已。
打算将其移植到AVR上，但CodeAVRC与IAR EC++在结构体、指针的定义使用上似乎与C51不太一样，现在还未搞定。还希望在这方面有经验的网友能给予指导。-C51 with the Pinyin input method, which is rewritten netizens embuffalo. Unrivaled www.21ic.com available in the free publication of the original work by Kai-51 on the Pinyin input method procedures . Appreciate the use of a two-dimensional array for the look-up table, I think this is a waste of space. Each of the characters but the index table to manually input address, efficiency is not high. I use the structure to rewrite a bit. We see now is this. Because the code comparison, a total of 6, more than 000 Chinese characters, this must be 12, byte to store 000 GB code, is not the way to compile results :-( about 3000h. because most of the index table. Code Optimization almost ineffective. Keil in the C simulation uses the chip in W77E58 Winbond, It has 32 k ROM 256B on-chip RAM, 1K on-chi Platform: |
Size: 14336 |
Author:Jawen |
Hits:
Description: 1）实现以下常用的内部排序算法并对它们的时间效率进行比较：
必做（6种）：起泡排序、直接插入排序、简单选择排序、快速排序、希尔排序、堆排序；
选做：折半插入、二路归并、基数排序等等；
2）函数首部要求：void XXXXSort(char **list, int len, int n, int *c, int *s)
其中：
a) XXXXSort为排序函数名，具体如下：
起泡排序BubbleSort
直接插入排序InsertSort
简单选择排序SelectSort
快速排序QuickSort
希尔排序ShellSort
堆排序HeapSort
折半插入BInsertSort
二路归并Merge2Sort
基数排序RadixSort
b) list为二维字符数组的头指针，该二维数组的规格为：char list[n][len] 每行用于存放一个字符串（最大长度为len-1），共n行；
c) c用于返回关键字比较次数；
d) s用于返回移动次数；
3）要求把各种排序函数做成函数库（文件名统一为：sort.c），用统一提供的主程序进行调用和测评。
-a) achieve the following commonly used internal sorting algorithm as well as their time efficiency comparison : regimen (6) : bubble sort, direct insertion sequence and simple choice sorting, quick sort, Hill, ranked Heap Sort; elected to do : half of insertion, two-way merge. Sort base, and so on; 2) function first requirement : void XXXXSort (char** list, int len, int n, int* c, int* s) which : a) XXXXSort sort of a function name, as follows : bubble sort BubbleSort direct insertion sort InsertSort simple choice ranking Sele ctSort Quick Sort QuickSort Hill Sorting ShellSort Heap Sort HeapS ort half insert BInsertSort two-way merge Merge2Sort radix sort Radi xSort b) list for the two-dimensional array of characters in the first indicator, the two-dimensional array specifications : cha Platform: |
Size: 10240 |
Author:战天 |
Hits:
Description: 数据结构实验4报告，实验内容或题目
l、随机产生n=100，200，300，1000，2000个整数并存于数组r[1..n]中。对主要查找算法（顺序查找、插入排序、冒泡排序、堆排序、快速排序）进行实验比较，计算出平均比较次数、平均移动次数及执行时间。由程序自动计算，由手工计时。
2、对实验结果数据进行对比分析。
主要内容是-4 reports the experimental data structure, content or subject of the experiment l, randomly generated integers n = 100,200,300,1000,2000 co-exist in the array r [1 .. n] in. On the main search algorithm (the order of search, Insertion Sort, Bubble Sort, Heap Sort, Quick Sort) for the comparison, the calculated average number of comparison, the average mobile number and execution time. Automatically calculated by the procedure by manual timing. 2, the experimental results the data were analyzed. Main content Platform: |
Size: 122880 |
Author:陶东魏 |
Hits:
Description: 基于阵列天线的CAPON和MUSIC频率谱估计仿真分析比较-Array antenna based on the Capon and MUSIC frequency spectrum estimation Simulation Analysis and Comparison Platform: |
Size: 1024 |
Author:袁峰 |
Hits:
Description: 随机产生个整数n=100，200，300，1000，2000个整数并存于数组r[1..n]中。 对主要查找算法（顺序查找、插入排序、冒泡排序、堆排序、快速排序）进行实验比较，计算出平均比较次数、平均移动次数及执行时间。由程序自动计算.-Randomly generated integers integers n = 100,200,300,1000,2000 co-exist in the array r [1 .. n] in. On the main search algorithm (the order of search, Insertion Sort, Bubble Sort, Heap Sort, Quick Sort) for the comparison, the calculated average number of comparison, the average mobile number and execution time. Automatically calculated by the procedure. Platform: |
Size: 17408 |
Author:侯健 |
Hits:
Description: 相控阵雷达资源调度策略，分别针对有时间窗和无时间窗的两种策略比较-Phased array radar resource scheduling strategy, respectively, for the time windows and no time window Comparison of two strategies Platform: |
Size: 6144 |
Author:backyes |
Hits:
Description: 阵列信号处理算法MATLAB常用程序，包括常用的AR,MUSIC,ESPRIT,GMUSIC程序及性能比较分析，很详细-MATLAB array signal processing algorithms commonly used procedures, including the popular AR, MUSIC, ESPRIT, GMUSIC procedures and performance comparison analysis, very detailed Platform: |
Size: 6581248 |
Author:fox |
Hits:
Description: In this Rsearch Paper a comparaison of MPPT methods is given, the performance of each method is discussed. Platform: |
Size: 210944 |
Author:N@dir |
Hits:
Description: 首先开设一个空间比较大的数组，从数组尾部开始。比较最后一个数和最
初设置在数组中的一个最大值，使得最小子序列及最小子序列初始化。记录在当前位置的最小子序列数，接着，继续与在其前面相邻的数进行比较。如果后者大于前者，者比较二者携带记录的最小子序列数的大小，如果后者持有的最小子序列数大于前者，则以后者为基准，最小子序列保持不变。反之，则将后者的子序列数自加一，将其改为前所持有的最小子序列数。继续重复前面的动作，最后得出最长不下降子序列的数目及内容。
-First to open a larger space for the array, starting from the end of the array. Comparison of the last number and the most
Early to set a maximum value in the array, making a minimal sequence and the sequence of a minimal initialization. A minimal sequence number recorded in the current location, and then continue to work with in front of the adjacent number to compare. If the latter than the former, the size of the minimal sequence number of compare the two brought into the record, if the latter holds the minimal sequence number is greater than the former, the latter as a benchmark, a minimal sequence remains unchanged. On the contrary, is the latter sub-sequence number from plus one to change it held before the minimal sequence number. Continue to repeat the previous action, and finally arrive at the number and content of up to drop the sub-sequence. Platform: |
Size: 1024 |
Author:刘善梅 |
Hits:
Description: 仿真了均匀线性阵的波束形成，对比了不同加权下的波束形成。可以改变来波方向，效果明显。-Simulation of a uniform linear array beamforming, comparison under different weighting beamforming. You can change the direction of the incoming wave, the effect is obvious. Platform: |
Size: 1024 |
Author:刘超 |
Hits:
Description: This code uses MATLAB s Internal Functions and Memory Preallocations to apply a Fast Implementation of kmeans algorithm. This is a efficient code for clustering a gray or Color image or it can be used for clustering a Multidimensional Array.
Comparison.
1. Faster than MATLAB s internal kmeans function.
2. Consistant Output than internal kmeans.
3. 100 convergence. -This code uses MATLAB s Internal Functions and Memory Preallocations to apply a Fast Implementation of kmeans algorithm. This is a efficient code for clustering a gray or Color image or it can be used for clustering a Multidimensional Array.
Comparison.
1. Faster than MATLAB s internal kmeans function.
2. Consistant Output than internal kmeans.
3. 100 convergence. Platform: |
Size: 2048 |
Author:manu |
Hits:
Description: 数组比较大小,若干个二维数组比较大小，并且统计出变化一致与不一致的个数。-Compare the size of the array, a plurality of two-dimensional array of size comparison, and the statistics in line with changes in the number of inconsistencies. Platform: |
Size: 2048 |
Author:郭佳伟 |
Hits:
Description: 超级列表框与数组比对，数组有超级列表就添加，数组没有超级列表就删除，数据变化就修改超级列表框内容(Super list box and array comparison, array has super list to add, array without super list to delete, data changes to modify the super list box content) Platform: |
Size: 590848 |
Author:随便取名
|
Hits:
Search - array comparison